Balanced Incomplete Block Designs and Other Combinatorial Objects
نویسنده
چکیده
Suppose we have a committee composed of a large number of members, and from this committee we wish to create a number of smaller subcommittees, each containing exactly the same number of members. Furthermore, in order to preserve equality and keep all committee members happy, each member must sit on exactly the same number of subcommittees and each pair of members must also sit on the same number of subcommittees. Is it possible to create such a family of subcommittees? The structure of such a system of subcommittees can be described mathematically by a balanced block design, and the existence of a suitable design depends on the desired value of each of the parameters.
منابع مشابه
Balanced nested designs and balanced arrays
Balanced nested designs are closely related to other combinatorial structures such as balanced arrays and balanced n-ary designs. In particular, the existence of symmetric balanced nested designs is equivalent to the existence of some balanced arrays. In this paper, various constructions for symmetric balanced nested designs are provided. They are used to determine the spectrum of symmetric bal...
متن کاملHybrid Key pre-distribution scheme for wireless sensor network based on combinatorial design
Key distribution is an important problem in wireless sensor networks where sensor nodesare randomly scattered in adversarial environments.Due to the random deployment of sensors, a list of keys must be pre-distributed to each sensor node before deployment. To establish a secure communication, two nodes must share common key from their key-rings. Otherwise, they can find a key- path in which ens...
متن کاملIsomorph-Free Exhaustive Generation
We describe a very general technique for generating families of combinatorial objects without isomorphs. It applies to almost any class of objects for which an inductive construction process exists. In one form of our technique, no explicit isomorphism testing is required. In the other form, isomorph testing is restricted to within small subsets of the entire set of objects. A variety of differ...
متن کاملConstructing Cyclic PBIBD(2)s through an Optimization Approach: Thirty Two New Cyclic Designs
We formulate the construction of cyclic partially balanced incomplete block designs with 2 associate classes as a combinatorial optimization problem. We propose an algorithm based on tabu search to tackle the problem. Our algorithm constructed 32 new cyclic designs.
متن کاملInvited Talks
In 2009, Peter Cameron introduced a common generalization of various classes of combinatorial designs such as balanced incomplete block designs, resolvable designs and orthogonal arrays. Generalized covering and packing designs can be defined in analogous way. These objects bring into this framework further classes of designs, including covering and packing arrays, Howell designs, monogamous cy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011